Sparse Graph Codes for Mult Signal Shap
نویسنده
چکیده
We present a method to combine error-correction coding and spectral-efficient modulation for transmission over the Additive White Gaussian Noise (AWGN) channel. The code employs signal shaping which can provide a so-called shaping gain. The code belongs to the family of sparse graph codes for which efficient decoding algorithms can be derived. Simulation results show that the performance of the code is quite good compared to other coded modulation schemes proposed in literature.
منابع مشابه
Sub-linear Time Support Recovery for Compressed Sensing using Sparse-Graph Codes
We address the problem of robustly recovering the support of high-dimensional sparse signals1 from linear measurements in a low-dimensional subspace. We introduce a new family of sparse measurement matrices associated with low-complexity recovery algorithms. Our measurement system is designed to capture observations of the signal through sparse-graph codes, and to recover the signal by using a ...
متن کاملSub-linear Time Compressed Sensing for Support Recovery using Sparse-Graph Codes
We address the problem of robustly recovering the support of high-dimensional sparse signals1 from linear measurements in a low-dimensional subspace. We introduce a new compressed sensing framework through carefully designed sparse measurement matrices associated with low measurement costs and low-complexity recovery algorithms. The measurement system in our framework captures observations of t...
متن کاملSparse graph codes for compression, sensing, and secrecy
Sparse graph codes were first introduced by Gallager over 40 years ago. Over the last two decades, such codes have been the subject of intense research, and capacityapproaching sparse graph codes with low complexity encoding and decoding algorithms have been designed for many channels. Motivated by the success of sparse graph codes for channel coding, we explore the use of sparse graph codes fo...
متن کاملSparse Regression Codes
Developing computationally-efficient codes that approach the Shannon-theoretic limits for communication and compression has long been one of the major goals of information and coding theory. There have been significant advances towards this goal in the last couple of decades, with the emergence of turbo and sparse-graph codes in the ‘90s [1, 2], and more recently polar codes and spatially-coupl...
متن کاملFace Recognition using an Affine Sparse Coding approach
Sparse coding is an unsupervised method which learns a set of over-complete bases to represent data such as image and video. Sparse coding has increasing attraction for image classification applications in recent years. But in the cases where we have some similar images from different classes, such as face recognition applications, different images may be classified into the same class, and hen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005